翻訳と辞書 Words near each other ・ Rastko Petrović ・ Rastko Stojković ・ Rastkogel ・ Rastla ・ Rastlose Liebe ・ Rastnik ・ Rastodentidae ・ Rastoder ・ Rastogi ・ Rastok ・ Rastoka ・ RASSF8 ・ RASSF9 ・ Rasshua ・ Rassi ・ Rassias' conjecture ・ Rassids ・ Rassie Erasmus ・ Rassie van der Dussen ・ Rassie van Vuuren ・ Rassilon ・ Rassim al-Jumaili ・ Rassiotsa ・ Rasskazov ・ Rasskazovka ・ Rasskazovo ・ Rasskazovo (inhabited locality) ・ Rasskazovsky District ・ Rasso ・ Rassolnik Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Rassias' conjecture ： ウィキペディア英語版 Rassias' conjecture In number theory, Rassias' conjecture (named after Michael Th. Rassias) is an open problem related to prime numbers. It was conceived by M. Th. Rassias at a very young age, while preparing for the International Mathematical Olympiad (see ). The conjecture states the following: For every prime number $p>2$ there exist two prime numbers $p\_1,$ $p\_2,$ with :$p=\backslash frac$ This conjecture has a surprising feature of expressing a prime number as a quotient (see 〔). == Relation to other open problems == Rassias' conjecture, can be stated equivalently as follows: For any prime number $p>2$ there exist two prime numbers $p\_1,$ $p\_2$ with :$(p-1)p\_1=p\_2+1,$ namely the numbers $(p-1)p\_1$ and $p\_2$ are consecutive. By this reformulation, we see an interesting combination of a generalized Sophie Germain twin problem :$p\_2=2ap\_1-1,$ strengthened by the additional condition that $2a+1$ be a prime number too (see 〔〔). We have seen that such questions are caught by the Hardy–Littlewood conjecture. One may ask if Rassias' conjecture is to some extent simpler than the general Hardy–Littlewood conjecture or its special case concerning distribution of generalized Sophie-Germain pairs $p,$ $2ap+1\backslash in\backslash mathbb$, where $\backslash mathbb$ denotes the set of prime numbers. Probably the most general conjecture on distribution of prime constellations is Schinzel's hypothesis H: ''Consider $s$ polynomials $f\_(x)\; \backslash in\; \backslash mathbb(),\backslash \; i\; =\; 1,\; 2,\; \backslash ldots,\; s$ with positive leading coefficients and such that the product $F(X)\; =\; \backslash prod\_^\; f\_(x)$ is not divisible, as a polynomial, by any integer different from ±1. Then there is at least one integer $x$ for which all the polynomials $f\_(x)$ take prime values.'' Rassias' conjecture follows from the well-known Schinzel's hypothesis H for $s\; =\; 2$ with $f\_(x)\; =\; x$ and $f\_(x)\; =\; 2ax-1$. Note that Schinzel's hypothesis H appeared much earlier than Rassias' conjecture which is its special case. The reader is referred to the foreword of Preda Mihăilescu〔 for a presentation of interconnections of Rassias' conjecture with other known conjectures and open problems in Number Theory. Further, another relevant open problem is related to Cunningham chains, i.e. sequences of primes :$p\_=mp\_i+n,\backslash \; i=1,2,\backslash ldots,\; k-1,$ for fixed coprime positive integers $m,n>1$. There are computing competitions for the longest Cunningham chain or for the one built up of the largest primes – but unlike the breakthrough of Ben J. Green and Terence Tao, there is no general result known on large Cunningham chains to date. Rassias' conjecture can be also stated in terms of Cunningham chains, namely that there exist Cunningham chains with parameters $2a,\; -1$ for $a$ such that $2a-1=p$ is a prime number (see 〔〔). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Rassias' conjecture」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.